全文获取类型
收费全文 | 28415篇 |
免费 | 3898篇 |
国内免费 | 3300篇 |
专业分类
电工技术 | 3035篇 |
综合类 | 3970篇 |
化学工业 | 1276篇 |
金属工艺 | 577篇 |
机械仪表 | 1631篇 |
建筑科学 | 912篇 |
矿业工程 | 381篇 |
能源动力 | 453篇 |
轻工业 | 690篇 |
水利工程 | 470篇 |
石油天然气 | 523篇 |
武器工业 | 368篇 |
无线电 | 3850篇 |
一般工业技术 | 2659篇 |
冶金工业 | 582篇 |
原子能技术 | 219篇 |
自动化技术 | 14017篇 |
出版年
2024年 | 86篇 |
2023年 | 404篇 |
2022年 | 660篇 |
2021年 | 739篇 |
2020年 | 898篇 |
2019年 | 905篇 |
2018年 | 822篇 |
2017年 | 1184篇 |
2016年 | 1262篇 |
2015年 | 1362篇 |
2014年 | 1824篇 |
2013年 | 2374篇 |
2012年 | 2197篇 |
2011年 | 2328篇 |
2010年 | 1805篇 |
2009年 | 1938篇 |
2008年 | 1938篇 |
2007年 | 2029篇 |
2006年 | 1627篇 |
2005年 | 1479篇 |
2004年 | 1220篇 |
2003年 | 1010篇 |
2002年 | 893篇 |
2001年 | 753篇 |
2000年 | 668篇 |
1999年 | 512篇 |
1998年 | 378篇 |
1997年 | 394篇 |
1996年 | 289篇 |
1995年 | 257篇 |
1994年 | 229篇 |
1993年 | 186篇 |
1992年 | 156篇 |
1991年 | 145篇 |
1990年 | 116篇 |
1989年 | 98篇 |
1988年 | 67篇 |
1987年 | 47篇 |
1986年 | 29篇 |
1985年 | 28篇 |
1984年 | 37篇 |
1983年 | 47篇 |
1982年 | 38篇 |
1981年 | 34篇 |
1980年 | 28篇 |
1979年 | 15篇 |
1978年 | 16篇 |
1977年 | 17篇 |
1976年 | 9篇 |
1975年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 562 毫秒
21.
In this letter, we address the problem of Direction of Arrival (DOA) estimation with nonuniform linear array in the context of sparse Bayesian learning (SBL) framework. The nonuniform array output is deemed as an incomplete-data observation, and a hypothetical uniform linear array output is treated as an unavailable complete-data observation. Then the Expectation-Maximization (EM) criterion is directly utilized to iteratively maximize the expected value of the complete-data log likelihood under the posterior distribution of the latent variable. The novelties of the proposed method lie in its capability of interpolating the actual received data to a virtual uniform linear array, therefore extending the achievable array aperture. Simulation results manifests the superiority of the proposed method over off-the-shelf algorithms, specially on circumstances such as low SNR, insufficient snapshots, and spatially adjacent sources. 相似文献
22.
23.
D.R. Santos‐Peñate C.M. Campos‐Rodríguez J.A. Moreno‐Pérez 《International Transactions in Operational Research》2019,26(1):340-363
The ‐centroid problem or leader–follower problem is generalized considering different customer choice rules where a customer may use facilities belonging to different firms, if the difference in travel distance (or time) is small enough. Assuming essential goods, some particular customer choice rules are analyzed. Linear programming formulations for the generalized ‐medianoid and ‐centroid problems are presented and an exact solution approach is applied. Some computational examples are included. 相似文献
24.
Semantic search is gradually establishing itself as the next generation search paradigm, which meets better a wider range of information needs, as compared to traditional full-text search. At the same time, however, expanding search towards document structure and external, formal knowledge sources (e.g. LOD resources) remains challenging, especially with respect to efficiency, usability, and scalability.This paper introduces Mímir—an open-source framework for integrated semantic search over text, document structure, linguistic annotations, and formal semantic knowledge. Mímir supports complex structural queries, as well as basic keyword search.Exploratory search and sense-making are supported through information visualisation interfaces, such as co-occurrence matrices and term clouds. There is also an interactive retrieval interface, where users can save, refine, and analyse the results of a semantic search over time. The more well-studied precision-oriented information seeking searches are also well supported.The generic and extensible nature of the Mímir platform is demonstrated through three different, real-world applications, one of which required indexing and search over tens of millions of documents and fifty to hundred times as many semantic annotations. Scaling up to over 150 million documents was also accomplished, via index federation and cloud-based deployment. 相似文献
25.
This paper is concerned with the problem of joint input and state estimation for linear stochastic systems with direct feedthrough. Based on the fact that each unknown input between any two time steps is always bounded, a novel improved algorithm is proposed. Compared with existing results, this algorithm can effectively enhance estimation accuracy. Moreover, the stability of the algorithm is also discussed. Finally, an illustrative example is given to demonstrate the effectiveness of the proposed approach. 相似文献
26.
Thermal comfort is an important factor for the design of buildings. Although it has been well recognized that many physiological parameters are linked to the state of thermal comfort or discomfort of humans, how to use physiological signal to judge the state of thermal comfort has not been well studied. In this paper, the feasibility of continuously determining feelings of personal thermal comfort was discussed by using electroencephalogram (EEG) signals in private space. In the study, 22 subjects were exposed to thermally comfortable and uncomfortably hot environments, and their EEG signals were recorded. Spectral power features of the EEG signals were extracted, and an ensemble learning method using linear discriminant analysis or support vector machine as a sub-classifier was used to build the discriminant model. The results show that an average discriminate accuracy of 87.9% can be obtained within a detection window of 60 seconds. This study indicates that it is feasible to distinguish whether a person feels comfortable or too hot in their private space by multi-channel EEG signals without interruption and suggests possibility for further applications in neuroergonomics. 相似文献
27.
Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search. 相似文献
28.
Greg A. Breed Paul M. Severns Andrew M. Edwards 《Journal of the Royal Society Interface》2015,12(103)
Lévy flights have gained prominence for analysis of animal movement. In a Lévy flight, step-lengths are drawn from a heavy-tailed distribution such as a power law (PL), and a large number of empirical demonstrations have been published. Others, however, have suggested that animal movement is ill fit by PL distributions or contend a state-switching process better explains apparent Lévy flight movement patterns. We used a mix of direct behavioural observations and GPS tracking to understand step-length patterns in females of two related butterflies. We initially found movement in one species (Euphydryas editha taylori) was best fit by a bounded PL, evidence of a Lévy flight, while the other (Euphydryas phaeton) was best fit by an exponential distribution. Subsequent analyses introduced additional candidate models and used behavioural observations to sort steps based on intraspecific interactions (interactions were rare in E. phaeton but common in E. e. taylori). These analyses showed a mixed-exponential is favoured over the bounded PL for E. e. taylori and that when step-lengths were sorted into states based on the influence of harassing conspecific males, both states were best fit by simple exponential distributions. The direct behavioural observations allowed us to infer the underlying behavioural mechanism is a state-switching process driven by intraspecific interactions rather than a Lévy flight. 相似文献
29.
30.